Approximation of convex bodies and a momentum lemma for power diagrams
نویسندگان
چکیده
Let C be a convex body in Euclidean d-space IE , i.e., a compact convex set with non-empty interior, and denote by P i n and P (n) the set of polytopes with at most n vertices inscribed to C and the set of polytopes with at most n facets circumscribed to C, respectively. Denote by δ(., .) the symmetric difference metric. Beginning with the work of L. Fejes Tóth [2], there are many investigations (cf. the survey [5]) on the asymptotic behavior as n→∞ of the distance of C to its best approximating polytopes with at most n vertices or facets, i.e., of
منابع مشابه
Joint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks
Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...
متن کاملA HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملRandom Polytopes, Convex Bodies, and Approximation
Assume K ⊂ R is a convex body and Xn ⊂ K is a random sample of n uniform, independent points from K. The convex hull of Xn is a convex polytope Kn called random polytope inscribed in K. We are going to investigate various properties of this polytope: for instance how well it approximates K, or how many vertices and facets it has. It turns out that Kn is very close to the so called floating body...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کامل